On Mints' Reduction for ccc-Calculus

A formalization of the strong normalization proof for system F in LEGO p. 13 Partial intersection type assignment in applicative term rewriting systems p. 29 Extracting constructive content from classical logic via control-like reductions p. 45 Combining first and higher order rewrite systems with type assignment systems p. 60 A term calculus for intuitionistic linear logic p. 75 Program extraction from normalization proofs p. 91 A semantics for [lambda]and-early: a calculus with overloading and early binding p. 107 An abstract notion of application p. 124 The undecidability of typability in the lambda-pi-calculus p. 139 Recursive types are not conservative over [actual symbol not reproducible] p. 146 The conservation theorem revisited p. 163 Modified realizability toposes and strong normalization proofs p. 179 Semantics of lambda-I and of other substructure lambda calculi p. 195 Translating dependent type theory into higher order logic p. 209 Studying the fully abstract model of PCF within its continuous function model p. 230 A new characterization of lambda definability p. 245 Combining recursive and dynamic types p. 258 Lambda calculus characterizations of poly-time p. 274 Pure type systems formalized p. 289 Orthogonal higher-order rewrite systems are confluent p. 306 Monotonic versus antimonotonic exponentiation p. 318 Inductive definitions in the system Coq; rules and properties p. 328 Intersection types and bounded polymorphism p. 346 A logic for parametric polymorphism p. 361 Call-by-value and nondeterminism p. 376 Lower and upper bounds for reductions of types in [actual symbol not reproducible] and [lambda]P p. 391 [lambda]-calculi with conditional rules p. 406 Type reconstruction in [actual symbol not reproducible] is undecidable p. 418